AREAS , NODES AND NETWORKS : Some Analytical Considerations
نویسنده
چکیده
In spatial interaction modelling, trips between origins and destinations within the same areal zone have a predominant influence on both the value of the gravity parameter and on the associated pattern of flows. Despite this, the relevant highly sensitive intrazonal impedance values are usually based on approximate average intrazonal distances or times. This situation has been identified in the literature as the ‘self potential’ problem. In this paper, integration over continuous space within the origin-destination zones is applied to not only compute the intrazonal flows more accurately, but also to evaluate the interzonal flows along shortest path routes meeting the interzonal links at efficient intermediate points. In particular, this general approach permits more accurate corrections to the conventional model, allowing, for instance, the usual approximations in determining average trip length to contiguous zones to be overcome. In addition, all jobs can be taken as concentrated at zonal centroids which are also nodes of the transport network. Alternatively, for outer zones, jobs may be taken as dispersed throughout the zonal area. This latter option reflects the greater dispersion of service jobs within suburban areas. The eventual aim is to develop practical ‘rules of thumb’ for correcting the conventional analysis. Flows between areal zones and several facility nodes can occur along plausible alternative multi-destination paths, rather than via one ‘abstract’ interzonal path to one destination, as usually considered in conventional spatial interaction models. Such destination/path choice is easy to handle in the relatively uncongested conditions characterizing off-peak discretionary travel. This paper examines facility choice via alternative round trip routes, attempting to discern the influence of ‘intervening opportunities’ on the potential for multi-stop trips without having to fully identify the actual trip chain. Such intervening opportunities can only be properly considered along the alternative paths of the actual network, as specified above.
منابع مشابه
Routing Hole Handling Techniques for Wireless Sensor Networks: A Review
A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...
متن کاملOptimization of splitting node placement in wavelength-routed optical networks
This paper addresses the placement of multicast nodes in wavelength-routed all-optical networks. This problem is motivated by the expected high cost of optical multicast cross-connects due to fabrication complexity and power considerations. An analytical model for the approximate blocking probability in multicast networks is developed. The blocking performance is used to guide an iterative algo...
متن کاملA novel key management scheme for heterogeneous sensor networks based on the position of nodes
Wireless sensor networks (WSNs) have many applications in the areas of commercial, military and environmental requirements. Regarding the deployment of low cost sensor nodes with restricted energy resources, these networks face a lot of security challenges. A basic approach for preparing a secure wireless communication in WSNs, is to propose an efficient cryptographic key management protocol be...
متن کاملRAWSN: A Routing Algorithm Based on Auxiliary Nodes to Reduce Energy Consumption in Wireless Sensor Networks
In this paper, an algorithm , based on genetics and auxiliary nodes, to reduce energy consumption in wireless sensor networks has been presented. In this research, by considering some parameters as energy and distance, a target function has been created, which is more optimum comparing to other methods. In this research cluster head is selected by genetic algorithm. In RAWSN algorithm a new tec...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملEnergy Efficiency in Wireless Sensor Networks Using Packet Splitting Technique
The wireless sensor network is an ad – hoc network. It consist of small light weighted wireless nodes called sensor nodes. The analytical model that allows us to derive some accurate results regarding energy consumption and complexity. Also, some main considerations about the implementation of the proposed technique in a real sensor network, i.e., by taking into account erasure channels, MAClay...
متن کامل